Mining product recommendation from query reformulations

ABSTRACT

In various example embodiments, systems and methods to mine product recommendations from query reformulation is provided. In example embodiments, a search query is mapped to a particular product. Transition data for the particular product is accessed. The transition data includes values reflecting a number of search transitions between the particular product and other products in session sets of previous queries. One or more recommendations based on the transition data is determined and provided to the user.

RELATED APPLICATIONS

This application is a continuation of and claims the benefit of priorityunder to U.S. patent application Ser. No. 14/051,794, filed Oct. 11,2013, which is a continuation of U.S. patent application Ser. No.12/878,729, filed Sep. 9, 2010, each of which are incorporated herein byreference in its entirety.

FIELD

The present disclosure relates generally to the field of computertechnology, and in a specific example embodiment, to mining productrecommendation from query reformulations.

BACKGROUND

Websites provide a number of publishing, listing, and price-settingmechanisms whereby a user (e.g., a seller) may list or publishinformation concerning items. In one example, the items may be items forsale by the seller. In this example, users (e.g., buyers) may search foritems and receive recommendations. In conventional systems, therecommendations are based on past purchase history of other users. Forexample, other users that have purchased item1 also purchased item2.Therefore, if the user selects item1, the user is provided arecommendation to item2. Purchase history recommendations are usuallylimited to identifying complementary items. For example, item2 istypically an accessory for item1.

BRIEF DESCRIPTION OF DRAWINGS

The appended drawings merely illustrate example embodiments of thepresent invention and cannot be considered as limiting its scope.

FIG. 1 is a block diagram illustrating an example embodiment of anetwork architecture of a system used to identify items depicted inimages.

FIG. 2 is a block diagram illustrating an example embodiment of apublication system.

FIG. 3 is a block diagram illustrating an example embodiment of arecommendation engine.

FIG. 4 is an example transition graph.

FIG. 5 is a flow diagram of an example method to perform queryreformulation.

FIG. 6 is a flow diagram of an example method to provide recommendationsbased on query reformulation.

FIG. 7 is a simplified block diagram of a machine in an example form ofa computing system within which a set of instructions for causing themachine to perform any one or more of the methodologies discussed hereinmay be executed.

DETAILED DESCRIPTION

The description that follows includes systems, methods, techniques,instruction sequences, and computing machine program products thatembody illustrative embodiments of the present invention. In thefollowing description, for purposes of explanation, numerous specificdetails are set forth in order to provide an understanding of variousembodiments of the inventive subject matter. It will be evident,however, to those skilled in the art that embodiments of the inventivesubject matter may be practiced without these specific details. Ingeneral, well-known instruction instances, protocols, structures, andtechniques have not been shown in detail.

As used herein, the term “or” may be construed in either an inclusive orexclusive sense. Additionally, although various example embodimentsdiscussed below focus on a network-based publication environment, theembodiments are given merely for clarity in disclosure. Thus, any typeof electronic publication, electronic commerce, or electronic businesssystem and method, including various system architectures, may employvarious embodiments of the system and method described herein and beconsidered as being within a scope of example embodiments. Each of avariety of example embodiments is discussed in detail below.

Example embodiments described herein provide systems and methods forproviding recommendations to a user based on query reformulation.Typically, a user will change terms used in queries when searching forproducts (e.g., item or information). A web session may comprise aseries of such queries (e.g., a session set). While each query isdirected to a particular product, not all queries are for the sameproduct. Users tend to transition between products between a first queryand an n^(th) query (e.g., changing from searching for one product to adifferent product). By using transition reformulation, recommendationsare directed to more equal level items (e.g., one type of handbag foranother type of handbag) instead of complementary items (e.g., an iPodand iPod accessories).

In one embodiment, a plurality of session sets received from a pluralityof users is collected. A session set comprises a series of queriesperformed during one search session by user. The plurality of sessionsets may then be processed in batches. The processing includes analyzingeach of the session sets to determine a search transition between twoproducts. Transition data directed to the search transition between thetwo products is updated. The updating of the transition data includesincrementing a transition count between the two products. The transitiondata is then used to provide a recommendation to another user who issearching for the same or similar product at a later time.

When the further user provides a search query that is mapped to theparticular product, transition data for the particular product isaccessed. The transition data includes values reflecting a number ofsearch transitions (e.g., transition count) in previous queries betweenthe particular product and other products. One or more recommendationsbased on the transition data is determined and provided to the user. Inone embodiment, a predetermined top number of products based on thetransition data are provided as the one or more recommendations.

By using embodiments of the present invention, a user performing asearch can be provided recommendations that may be more tailored to theuser's interest. Accordingly, one or more of the methodologies discussedherein may obviate a need for the user to conduct additional searching,which may have the technical effect of reducing computing resources usedby one or more devices within the system. Examples of such computingresources include, without limitation, processor cycles, networktraffic, memory usage, storage space, and power consumption.

With reference to FIG. 1, an example embodiment of a high-levelclient-server-based network architecture 100 to provide content based onan image is shown. A networked system 102, in an example form of anetwork-server-side functionality, is coupled via a communicationnetwork 104 (e.g., the Internet, wireless network, cellular network, ora Wide Area Network (WAN)) to one or more client devices 110 and 112.FIG. 1 illustrates, for example, a web client 106 operating via abrowser (e.g., such as the INTERNET EXPLORER® browser developed byMicrosoft® Corporation of Redmond, Wash. State), and a programmaticclient 108 executing on respective client devices 110 and 112.

The client devices 110 and 112 may comprise a mobile phone, desktopcomputer, laptop, or any other communication device that a user mayutilize to access the networked system 102. In some embodiments, theclient device 110 may comprise or be connectable to an image capturedevice (e.g., camera). The client device 110 may also comprise a voicerecognition module (not shown) to receive audio input and a displaymodule (not shown) to display information (e.g., in the form of userinterfaces). In further embodiments, the client device 110 may compriseone or more of a touch screen, accelerometer, and GPS device.

An Application Program Interface (API) server 114 and a web server 116are coupled to, and provide programmatic and web interfaces respectivelyto, one or more application servers 118. The application servers 118host a publication system 120 and a payment system 122, each of whichmay comprise one or more modules, applications, or engines, and each ofwhich may be embodied as hardware, software, firmware, or anycombination thereof. The application servers 118 are, in turn, coupledto one or more database servers 124 facilitating access to one or moreinformation storage repositories or database(s) 126. In one embodiment,the databases 126 are storage devices that store content, userpreferences, user profiles, transition data, or recommendation selectiondata.

The publication system 120 publishes content on a network (e.g.,Internet). As such, the publication system 120 provides a number ofpublication and marketplace functions and services to users that accessthe networked system 102. The publication system 120 is discussed inmore detail in connection with FIG. 2. In example embodiments, thepublication system 120 is discussed in terms of a marketplaceenvironment. However, it is noted that the publication system 120 may beassociated with a non-marketplace environment.

The payment system 122 provides a number of payment services andfunctions to users. The payment system 122 allows users to accumulatevalue (e.g., in a commercial currency, such as the U.S. dollar, or aproprietary currency, such as “points”) in accounts, and then later toredeem the accumulated value for products (e.g., goods or services) thatare made available via the publication system 120. The payment system122 also facilitates payments from a payment mechanism (e.g., a bankaccount, PayPal, or credit card) for purchases of items via thenetwork-based marketplace. While the publication system 120 and thepayment system 122 are shown in FIG. 1 to both form part of thenetworked system 102, it will be appreciated that, in alternativeembodiments, the payment system 122 may form part of a payment servicethat is separate and distinct from the networked system 102.

While the example network architecture 100 of FIG. 1 employs aclient-server architecture, a skilled artisan will recognize that thepresent disclosure is not limited to such an architecture. The examplenetwork architecture 100 can equally well find application in, forexample, a distributed or peer-to-peer architecture system. Thepublication system 120 and payment system 122 may also be implemented asstandalone systems or standalone software programs operating underseparate hardware platforms, which do not necessarily have networkingcapabilities.

Referring now to FIG. 2, an example block diagram illustrating multiplecomponents that, in one example embodiment, are provided within thepublication system 120 of the networked system 102 is shown. Thepublication system 120 may be hosted on dedicated or shared servermachines (not shown) that are communicatively coupled to enablecommunications between the server machines. The multiple components,themselves, are communicatively coupled (e.g., via appropriateinterfaces), either directly or indirectly, to each other and to variousdata sources, to allow information to be passed between the componentsor to allow the components to share and access common data. Furthermore,the components may access the one or more database(s) 126 via the one ormore database servers 124, both shown in FIG. 1.

In one embodiment, the publication system 120 provides a number ofpublishing, listing, and price-setting mechanisms whereby a seller maylist (or publish information concerning) goods or services for sale, abuyer can express interest in or indicate a desire to purchase suchgoods or services, and a price can be set for a transaction pertainingto the goods or services. To this end, the publication system 120 maycomprise at least one publication engine 202 and one or more auctionengines 204 that support auction-format listing and price settingmechanisms (e.g., English, Dutch, Chinese, Double, Reverse auctions,etc.). The various auction engines 204 also provide a number of featuresin support of these auction-format listings, such as a reserve pricefeature, whereby a seller may specify a reserve price in connection witha listing, and a proxy-bidding feature, whereby a bidder may invokeautomated proxy bidding.

A pricing engine 206 supports various price listing formats. One suchformat is a fixed-price listing format (e.g., the traditional classifiedadvertisement-type listing or a catalog listing). Another formatcomprises a buyout-type listing. Buyout-type listings (e.g., theBuy-It-Now (BIN) technology developed by eBay Inc., of San Jose, Calif.)may be offered in conjunction with auction-format listings and allow abuyer to purchase goods or services, which are also being offered forsale via an auction, for a fixed price that is typically higher than astarting price of an auction for an item.

A store engine 208 allows a seller to group listings within a “virtual”store, which may be branded and otherwise personalized by and for theseller. Such a virtual store may also offer promotions, incentives, andfeatures that are specific and personalized to the seller. In oneexample, the seller may offer a plurality of items as Buy-It-Now itemsin the virtual store, offer a plurality of items for auction, or acombination of both.

Navigation of the network-based publication system 120 may befacilitated by a navigation engine 210. For example, a search module(not shown) of the navigation engine 210 enables keyword queries oflistings published via the publication system 120. In a further example,a browse module (not shown) of the navigation engine 210 allows users tobrowse various category, catalog, or inventory data structures accordingto which listings may be classified within the publication system 120.Various other navigation applications within the navigation engine 210may be provided to supplement the searching and browsing applications.

A listing creation engine 212 allows sellers to conveniently authorlistings of items. In one embodiment, the listings pertain to goods orservices that a user (e.g., a seller) wishes to transact via thepublication system 120. Each good or service is associated with aparticular category. In other embodiments, a user may create a listingthat is an advertisement or other form of publication.

A recommendation engine 214 performs analysis on queries in order toprovide recommendations. In example embodiments, the recommendationengine 214 analyzes queries in order to determine transition graphs andrelated transition data. The transition graph is discussed in moredetail in connection with FIG. 4. Using the transition data,recommendations may be provided to users based on the user's currentquery. The recommendation engine 214 will be discussed in more detail inconnection with FIG. 3.

Although the various components of the publication system 120 have beendefined in terms of a variety of individual modules and engines, askilled artisan will recognize that many of the items can be combined ororganized in other ways. Furthermore, not all components of thepublication system 120 have been included in FIG. 2. In general,components, protocols, structures, and techniques not directly relatedto functions of example embodiments (e.g., dispute resolution engine,loyalty promotion engine, reputation engines, listing managementengines, etc.) have not been shown or discussed in detail. Thedescription given herein simply provides a variety of exampleembodiments to aid the reader in an understanding of the systems andmethods used herein.

Application of Embodiments of the Recommendation System into the ExampleNetwork Architecture

Referring now to FIG. 3, an example diagram of the recommendation engine214 is shown. In example embodiments, the recommendation engine 214comprises a data collection module 302, mapping module 304,reformulation module 306, and a recommendation module 308. Inalternative embodiments, one or more of the modules depicted within therecommendation engine 214 may be located within another component of thepublication system 120 (e.g., within the navigation engine 210).

The data collection module 302 collects all queries received by thepublication system 120. In one embodiment, the queries within a singlesearch session by each user are assembled into a session set for lateranalysis by the data collection module 302. Each session set is thenstored (e.g., in the databases 126) for later processing. The datacollection module 302 may also collect and store data directed toselections and non-selections of recommendations provided to users. Aselection of a recommendation may include viewing, watching, orpurchasing an item of the recommendation. The selection sets andselection data may then be processed in batches at a later time (e.g.,evenings, once a week). Furthermore, the session sets and selection datamay be processed during off-peak hours or when there is less demand forcomputing resources.

The data collection module 302 may further receive a current query froma user. The current query is forwarded to the recommendation module 308to determine recommendations to present to the user.

The mapping module 304 maps each query in the session set to a product.In example embodiments, the mapping module 304 maps the query to aproduct in a category based on keywords in a keyword query. In mappingthe query, the mapping module 304 takes into consideration commonmisspellings of words and synonyms. For example, if a user enters “Pradabag” as a keyword query, the mapping module 304 may map the query to aproduct “Prada purses” in category “bags,” “handbags,” or “purses.” Assuch, the mapping module 304 may maintain tables of query terms andtheir synonyms and common misspellings. In some embodiments, the querymay be mapped to more than one product.

The reformulation module 306 generates transition graphs andcorresponding transition data based on each session set. In exampleembodiments, the reformulation module 306 takes the mappings determinedby the mapping module 304 and increments a transition count for eachsearch transition between different products. In one embodiment, eachtransition performed by a user may cause a transition count for aparticular link between two products (e.g., transition data) to beincremented by a value of one (1). Continuing with the bag example, thereformulation module 306 increments a transition count for queries thattransition from “Prada bag” to “Gucci bag” each time the transitionoccurs. The reformulation module 306 may also increment a separatetransition count for queries that transition from “Gucci bag” to “Pradabag” each time that transition occurs.

The reformulation module 306 may further refine the results of thereformulation analysis. In an example embodiment, if the number oftransitions between two products does not meet a minimum threshold(e.g., transition count<transition count threshold) over a certainperiod of time, the transition data for a link between the two productsis not made accessible to the recommendation engine 214. The transitiondata, in this case, may simply be deleted since the transition count isbelow the transition count threshold for the latest batch of queriesbeing processed. In one embodiment, the transition count threshold isone (1).

Alternatively, the transition data (e.g., based on the transition count)may be temporarily stored in the database in case future reformulationanalysis increases the transition count between the two products to avalue above the transition count threshold. Furthermore, prior resultsof the reformulation analysis (e.g., the transition graphs and data) maybe updated or replaced after each batch process. By replacing orupdating the results of the reformulation analysis after each batchprocess, the recommendations provided by the recommendation engine 214are based on more current interest and demand for particular products.

In some embodiments, the transition data may be weighted based oninteractions with previous recommendations by users (e.g., based onrecommendation selection data). For example, if a particularrecommendation of a second product based on a first product is providedto a user but is not chosen by the user, the transition data for thelink between the first product and second product may be decremented(e.g., minus 0.1 from the transition count). Similarly, if a particularrecommendation of third product from the first product is suggested toand chosen by the user, the transition data for the link between thefirst product and the third product may be weighted in addition to anincrement in the transition count (e.g., transition count increased by1.1).

The recommendation module 308 provides recommendations to a current userbased on query reformulation. In a first instance of a search session,the recommendation module 308 receives a product indication (e.g.,mapping) based on a current query from the mapping module 304. Using theproduct indication, the recommendation module 308 accesses transitiondata to determine which other one or more products have a hightransition count relationship with the indicated product. In oneembodiment, the top m links associated with the highest transitioncounts serve as the recommendations, where m may be a default orprogrammable value.

It is noted that the top links based on the transition data may be basedon a one-way transition or a combined count. For example, if the userqueries “Prada bag,” the recommendation module 308 may determine the toplinks based on one-way transitions from “Prada bag” to ProductA,ProductB, and ProductC. Alternatively, the recommendation module 308 maydetermine the top links based on a combined count of transitions to andfrom “Prada bag” and ProductA, to and from “Prada bag” and ProductB, andto and from “Prada bag” and ProductC. Thus, a summation of thetransition data between two products is used. Further embodiments mayuse some other weighted function of the transition data between twoproducts.

The recommendations are then provided to the user by the recommendationmodule 308. In one embodiment, main search results may be positioned ina center of a web page while recommendations are provided along one ormore perimeters of the web page. The recommendations may be arecommendation for a particular product (e.g., one or more item listingsfor the particular product).

In further instances of the search session, the recommendation module308 may factor in selection or rejection of previous recommendations(e.g., recommendation selection data) provided within the same searchsession in providing the recommendations. For example, if the user isprovided a recommendation for ProductA for a certain maximumrecommendation threshold (e.g., three times) and the user does notselect the recommendation any of those times (e.g., instead choosing arecommendation for ProductB, ProductC, and ProductD), the recommendationmodule 308 may stop recommending ProductA. Alternatively, if the user isprovided a recommendation for ProductE and has selected therecommendation for further review, the recommendation module 308 may notprovide a recommendation for ProductE again since it was previouslyselected.

In some embodiments, the recommendation module 308 may provide acategory recommendation. For example, if a transition is between twoproducts belonging to the same class or category (e.g., bags), therecommendation module 308 may provide a recommendation to a different,complementary category (or products in a different category) having toplinks with the current category (e.g., from bags to shoes).

Alternatively, the recommendation module 308 may provide productrecommendations within a single category. In example embodiments, if atransition is between two products belonging to the same class orcategory (e.g., bags), the recommendation module 308 may provide arecommendation to a different product in the same category having toplinks. For example, if the transition is from a query for “Prada bags”to “Gucci bags,” the recommendation module 308 may recommend “LouisVuitton bags.”

In one embodiment, the settings used by the recommendation module 308 indetermining recommendations may be a default. Alternatively or inaddition, the user may adjust or set preferences for determiningrecommendations. For example, the user may indicate a maximum number oftimes a particular product should be recommended to the user, thatrecommendations be product based (and not category based), and howrecommendations are to be presented on an interface (e.g., peripheral ona web page, on a pop-up screen, image only, text only).

Referring to FIG. 4, an example transition graph is illustrated. While aphysical graph is shown, it is noted that a transition graph maycomprise a series of data and is not necessarily provided in a graphicalformat. The graph is used and discussed for illustrative purposes. Inthis example, the query is mapped to Product1, which is illustrated inthe center of the transition graph. Product1 is shown to have arecommendation depth of one with Product2, Product3, Product4, andProduct6. A value of transition data (e.g., transition count) fromProduct 1 to Product2 is 200, from Product1 to Product3 is 540, fromProduct1 to Product4 is 230, and from Product1 to Product6 is 1000. Thetransition graph also illustrates transition data from Product3 toProduct5 and from Product6 to Product7. Thus, Product5 and Product7 havea recommendation depth of two with respect to Product1. Furtherrecommendation depths may be used.

The recommendation module 308 is not restricted to a recommendationdepth of one when providing recommendations. However, transition datafor deeper recommendation depths (e.g., depth of two or more) may beweighted in order to determine priority. In one example, arecommendation depth of two may cause an application of a function thatdivides the transition data between the product at recommendation depthone with the product at recommendation depth two by a value of two,while a recommendation depth of three may cause an application of afunction that divides the transition data between the product atrecommendation depth two with the product at recommendation depth threeby a value of four. Thus for example, the transition data betweenProduct3 and Product5 is weighted to be a value of 150, while thetransition data between Product 6 and Product 7 is weighted to be avalue of 300. Therefore, the top three recommendations to be provided bythe recommendation module 308, in this example, would be Product6(transition data value=1000), Product3 (transition data value=540), andProduct? (weighted transition data value=300) in this same order. It isnoted that any function may be used in determining the weighted valuefor deeper recommendation depths.

FIG. 5 is a flow diagram of an example method 500 to perform queryreformulation. In operation 502, queries from a plurality of users arecollected. In example embodiments, the data collection module 302collects all queries received by the publication system 120 andassembles the questions into session sets for later analysis. Thesession sets are then stored (e.g., in the databases 126) for laterprocessing. The data collection module 302 also collects and stores datadirected to selections and non-selections of recommendations previouslyprovided to users (e.g., recommendation selection data).

In example embodiments, the collected session sets and selection datamay then be processed in batches at a later time or during off-peakhours. To that end, the queries in each session set are mapped toproducts in operation 504. The mapping module 304 may map the query to aproduct in a category based on keywords in the query. In mapping thequery, the mapping module 304 takes into consideration misspellings ofwords and synonyms for the keywords.

In operation 506, transition data is computed. In example embodiments,the reformulation module 306 generates a transition graph and thecorresponding transition data. The reformulation module 306 takes themappings determined in operation 504 and increments a transition count(e.g., by a value of one) each time a transition between differentproducts within the same session set occurs. The reformulation module306 also factors in prior recommendation selection data in computing thetransition data (e.g., the weight transition count).

The generated transition data is stored in operation 508. The transitiondata may replace previous versions of transition data stored forparticular products or categories, or may supplement the previouslystored transition data. The new transition data is then used indetermining recommendations for users.

FIG. 6 is a flow diagram of an example method 600 to providerecommendations based on query reformulation. In operation 602, acurrent search query is received from a user. In example embodiments,the current search query comprises a keyword search for a particularproduct which is received by the publication system 120. As noted above,the data collection module 302 receives the query in order to assemble asession set for future query reformulation. The current query isforwarded to the recommendation module 308 for recommendation analysis.Alternatively, the recommendation module 308 may receive the currentquery and forward it to the data collection module 302. In oneembodiment, the searches within a single search session are assembledinto a session set for later analysis by the data collection module 302.

The current query is mapped to a product in operation 604. In exampleembodiments, the mapping module 304 maps the query to a product (orcategory). Transition data for the product may then be accessed by therecommendation module 308.

A first set of recommendations are determined in operation 606. Thefirst set of recommendations is based on the current query and any userpreferences that may be been previously provided to the publicationsystem 120 (e.g., preferences stored in a user profile at thepublication system 120). The recommendation module 308 reviews thetransition data for the mapped product and determines a top number ofrecommendations. The top number of recommendations is then provided tothe querying user as the first set of recommendations.

In operation 608, a determination is made as to whether there is anothersearch query. If there is no further search query, then the method ends.However if there is another search query, then a further set ofrecommendations is provided in operation 610. In operation 610, thefurther set of recommendations may now be based on the mapped productcorresponding to the new query, user preferences, and previousrecommendation interactions (e.g., recommendation selection dataassociated with the current user in the current search session). Assuch, if the querying user has not selected a particular recommendationfor a maximum recommendation threshold, the particular recommendation isnot provided again. Similarly, if a particular recommendation isprovided and selected, the particular recommendation may not be providedagain.

Modules, Components, and Logic

Additionally, certain embodiments described herein may be implemented aslogic or a number of modules, engines, components, or mechanisms. Amodule, engine, logic, component, or mechanism (collectively referred toas a “module”) may be a tangible unit capable of performing certainoperations and configured or arranged in a certain manner. In certainexample embodiments, one or more computer systems (e.g., a standalone,client, or server computer system) or one or more components of acomputer system (e.g., a processor or a group of processors) may beconfigured by software (e.g., an application or application portion) orfirmware (note that software and firmware can generally be usedinterchangeably herein as is known by a skilled artisan) as a modulethat operates to perform certain operations described herein.

In various embodiments, a module may be implemented mechanically orelectronically. For example, a module may comprise dedicated circuitryor logic that is permanently configured (e.g., within a special-purposeprocessor, application specific integrated circuit (ASIC), or array) toperform certain operations. A module may also comprise programmablelogic or circuitry (e.g., as encompassed within a general-purposeprocessor or other programmable processor) that is temporarilyconfigured by software or firmware to perform certain operations. Itwill be appreciated that a decision to implement a module mechanically,in dedicated and permanently configured circuitry, or in temporarilyconfigured circuitry (e.g., configured by software) may be driven by,for example, cost, time, energy-usage, and package size considerations.

Accordingly, the term “module” should be understood to encompass atangible entity, be that an entity that is physically constructed,permanently configured (e.g., hardwired), or temporarily configured(e.g., programmed) to operate in a certain manner or to perform certainoperations described herein. Considering embodiments in which modules orcomponents are temporarily configured (e.g., programmed), each of themodules or components need not be configured or instantiated at any oneinstance in time. For example, where the modules or components comprisea general-purpose processor configured using software, thegeneral-purpose processor may be configured as respective differentmodules at different times. Software may accordingly configure theprocessor to constitute a particular module at one instance of time andto constitute a different module at a different instance of time.

Modules can provide information to, and receive information from, othermodules. Accordingly, the described modules may be regarded as beingcommunicatively coupled. Where multiples of such modules existcontemporaneously, communications may be achieved through signaltransmission (e.g., over appropriate circuits and buses) that connectthe modules. In embodiments in which multiple modules are configured orinstantiated at different times, communications between such modules maybe achieved, for example, through the storage and retrieval ofinformation in memory structures to which the multiple modules haveaccess. For example, one module may perform an operation and store theoutput of that operation in a memory device to which it iscommunicatively coupled. A further module may then, at a later time,access the memory device to retrieve and process the stored output.Modules may also initiate communications with input or output devicesand can operate on a resource (e.g., a collection of information).

Example Machine Architecture and Machine-Readable Storage Medium

With reference to FIG. 7, an example embodiment extends to a machine inthe example form of a computer system 700 within which instructions forcausing the machine to perform any one or more of the methodologiesdiscussed herein may be executed. In alternative example embodiments,the machine operates as a standalone device or may be connected (e.g.,networked) to other machines. In a networked deployment, the machine mayoperate in the capacity of a server or a client machine in server-clientnetwork environment, or as a peer machine in a peer-to-peer (ordistributed) network environment. The machine may be a personal computer(PC), a tablet PC, a set-top box (STB), a Personal Digital Assistant(PDA), a cellular telephone, a web appliance, a network router, a switchor bridge, or any machine capable of executing instructions (sequentialor otherwise) that specify actions to be taken by that machine. Further,while only a single machine is illustrated, the term “machine” shallalso be taken to include any collection of machines that individually orjointly execute a set (or multiple sets) of instructions to perform anyone or more of the methodologies discussed herein.

The example computer system 700 may include a processor 702 (e.g., acentral processing unit (CPU), a graphics processing unit (GPU) orboth), a main memory 704 and a static memory 706, which communicate witheach other via a bus 708. The computer system 700 may further include avideo display unit 710 (e.g., a liquid crystal display (LCD) or acathode ray tube (CRT)). In example embodiments, the computer system 700also includes one or more of an alpha-numeric input device 712 (e.g., akeyboard or touchscreen), a user interface (UI) navigation device orcursor control device 714 (e.g., a mouse or touchscreen), a disk driveunit 716, a signal generation device 718 (e.g., a speaker), and anetwork interface device 720.

Machine-Readable Storage Medium

The disk drive unit 716 includes a machine-readable storage medium 722on which is stored one or more sets of instructions 724 and datastructures (e.g., software instructions) embodying or used by any one ormore of the methodologies or functions described herein. Theinstructions 724 may also reside, completely or at least partially,within the main memory 704 or within the processor 702 during executionthereof by the computer system 700, with the main memory 704 and theprocessor 702 also constituting machine-readable media.

While the machine-readable storage medium 722 is shown in an exampleembodiment to be a single medium, the term “machine-readable storagemedium” may include a single storage medium or multiple storage media(e.g., a centralized or distributed database, or associated caches andservers) that store the one or more instructions 724. The term“machine-readable storage medium” shall also be taken to include anytangible medium that is capable of storing, encoding, or carryinginstructions for execution by the machine and that cause the machine toperform any one or more of the methodologies of embodiments of thepresent invention, or that is capable of storing, encoding, or carryingdata structures used by or associated with such instructions. The term“machine-readable storage medium” shall accordingly be taken to include,but not be limited to, solid-state memories and optical and magneticmedia. Specific examples of machine-readable storage media includenon-volatile memory, including by way of example semiconductor memorydevices (e.g., Erasable Programmable Read-Only Memory (EPROM),Electrically Erasable Programmable Read-Only Memory (EEPROM), and flashmemory devices); magnetic disks such as internal hard disks andremovable disks; magneto-optical disks; and CD-ROM and DVD-ROM disks.

Transmission Medium

The instructions 724 may further be transmitted or received over acommunications network 726 using a transmission medium via the networkinterface device 720 and utilizing any one of a number of well-knowntransfer protocols (e.g., HTTP). Examples of communication networksinclude a local area network (LAN), a wide area network (WAN), theInternet, mobile telephone networks, POTS networks, and wireless datanetworks (e.g., WiFi and WiMax networks). The term “transmission medium”shall be taken to include any intangible medium that is capable ofstoring, encoding, or carrying instructions for execution by themachine, and includes digital or analog communications signals or otherintangible medium to facilitate communication of such software.

Although an overview of the inventive subject matter has been describedwith reference to specific example embodiments, various modificationsand changes may be made to these embodiments without departing from thebroader spirit and scope of embodiments of the present invention. Suchembodiments of the inventive subject matter may be referred to herein,individually or collectively, by the term “invention” merely forconvenience and without intending to voluntarily limit the scope of thisapplication to any single invention or inventive concept if more thanone is, in fact, disclosed.

The embodiments illustrated herein are described in sufficient detail toenable those skilled in the art to practice the teachings disclosed.Other embodiments may be used and derived there from, such thatstructural and logical substitutions and changes may be made withoutdeparting from the scope of this disclosure. The Detailed Description,therefore, is not to be taken in a limiting sense, and the scope ofvarious embodiments is defined only by the appended claims, along withthe full range of equivalents to which such claims are entitled.

Moreover, plural instances may be provided for resources, operations, orstructures described herein as a single instance. Additionally,boundaries between various resources, operations, modules, engines, anddata stores are somewhat arbitrary, and particular operations areillustrated in a context of specific illustrative configurations. Otherallocations of functionality are envisioned and may fall within a scopeof various embodiments of the present invention. In general, structuresand functionality presented as separate resources in the exampleconfigurations may be implemented as a combined structure or resource.Similarly, structures and functionality presented as a single resourcemay be implemented as separate resources. These and other variations,modifications, additions, and improvements fall within a scope ofembodiments of the present invention as represented by the appendedclaims. The specification and drawings are, accordingly, to be regardedin an illustrative rather than a restrictive sense.

What is claimed is:
 1. A method comprising: mapping each search queryfrom a plurality of search sessions to a product; generating, by ahardware processor, transition data by incrementing a transition countcorresponding to a particular product and a different product each timea search query changes from the particular product to the differentproduct in a same search session of the plurality of search sessions;receiving a query that corresponds to the particular product;determining one or more recommendations based on the transition data;and causing a display of the one or more recommendations to a queryinguser.
 2. The method of claim 1, wherein the product is publishedinformation.
 3. The method of claim 1, wherein the product is aselection from the group comprising an item, a good, or a service. 4.The method of claim 1, wherein the determining the one or morerecommendations is based on a previous selection of a recommendation bythe querying user, the previous selection of the recommendation notbeing presented a second time.
 5. The method of claim 1, wherein thedetermining the one or more recommendations is based on a previousnon-selection of a recommendation by the querying user, thenon-selection of the recommendation for a maximum recommendationthreshold resulting in the non-selected recommendation not beingpresented thereafter.
 6. The method of claim 1, further comprisingapplying a weighting function to the transition data that is at arecommendation depth level greater than one.
 7. The method of claim 1,further comprising weighting the transition data based on selections andnon-selections of previous recommendations by a plurality of users. 8.The method of claim 1, wherein the mapping comprises mapping each searchquery based on a keyword in the search query taking into considerationmisspellings and synonyms.
 9. The method of claim 1, wherein the one ormore recommendations are to a different, complementary category of theparticular product.
 10. The method of claim 1, wherein the one or morerecommendations are to a further product in the same category as theparticular product.
 11. A machine-readable medium having no transitorysignals and storing instructions which, when executed by a processor ofa machine, cause the machine to perform operations comprising: mappingeach search query from a plurality of search sessions to a product;generating transition data by incrementing a transition countcorresponding to a particular product and a different product each timea search query changes from the particular product to the differentproduct in a same search session of the plurality of search sessions;receiving a query that corresponds to the particular product;determining one or more recommendations based on the transition data;and causing a display of the one or more recommendations to a queryinguser.
 12. The machine-readable medium of claim 11, wherein the productis published information.
 13. The machine-readable medium of claim 11,wherein the determining the one or more recommendations is based on aprevious selection of a recommendation by the querying user, theprevious selection of the recommendation not being presented a secondtime.
 14. The machine-readable medium of claim 11, wherein thedetermining the one or more recommendations is based on a previousnon-selection of a recommendation by the querying user, thenon-selection of the recommendation for a maximum recommendationthreshold resulting the non-selected recommendation not being presentedthereafter.
 15. The machine-readable medium of claim 11, wherein theoperations further comprise applying a weighting function to thetransition data that is at a recommendation depth level greater thanone.
 16. The machine-readable medium of claim 11, wherein the operationsfurther comprise weighting the transition data based on selections andnon-selections of previous recommendations by a plurality of users. 17.The machine-readable medium of claim 11, wherein the mapping comprisesmapping each search query based on a keyword in the search query takinginto consideration misspellings and synonyms.
 18. The machine-readablemedium of claim 11, wherein the one or more recommendations are to adifferent, complementary category of the particular product.
 19. Themachine-readable medium of claim 11, wherein the one or morerecommendations are to a further product in the same category as theparticular product.
 20. A system comprising: a mapping module to mapeach search query from a plurality of search sessions to a product; areformulation module, comprising a hardware processor, to generatetransition data by incrementing a transition count corresponding to aparticular product and a different product each time a search querychanges from the particular product to the different product in a samesearch session of the plurality of search sessions; and a recommendationmodule to receive a query that corresponds to the particular product, todetermine one or more recommendations based on the transition data, andto cause a display of the one or more recommendations to a queryinguser.